A Nonlinear Krylov Accelerator for the Boltzmann k-Eigenvalue Problem

نویسندگان

  • Matthew T. Calef
  • Erin D. Fichtl
  • James S. Warsa
  • Markus Berndt
  • Neil N. Carlson
چکیده

Matthew T. Calef, Erin D. Fichtl, James S. Warsa, Markus Berndt, Neil N. Carlson, CCS-2 We compare variants of Anderson Mixing with the Jacobian-Free Newton-Krylov and Broyden methods applied to the k-eigenvalue formulation of the linear Boltzmann transport equation. We present evidence that one variant of Anderson Mixing finds solutions in the fewest number of iterations. We examine and strengthen theoretical results of Anderson Mixing applied to linear problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nleigs: a Class of Robust Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems∗

A new rational Krylov method for the efficient solution of nonlinear eigenvalue problems, A(λ)x = 0, is proposed. This iterative method, called fully rational Krylov method for nonlinear eigenvalue problems (abbreviated as NLEIGS), is based on linear rational interpolation and generalizes the Newton rational Krylov method proposed in [R. Van Beeumen, K. Meerbergen, and W. Michiels, SIAM J. Sci....

متن کامل

Prediction of critical boundaries in two-parameter nonlinear eigenvalue problems

Prediction of critical boundaries (i.e. curves of singular points) in two-parameter nonlinear eigenvalue problems is considered. A generalization of the Krylov subspace for the one-parameter linear eigenvalue problem to the two-parameter case, suitable for the prediction of critical boundaries, is introduced. Methods for the eecient computation of the solution surface are developed. A case of t...

متن کامل

Projection Methods for Nonlinear Sparse Eigenvalue Problems

This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.

متن کامل

Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems

We propose a new uniform framework of Compact Rational Krylov (CORK) methods for solving large-scale nonlinear eigenvalue problems: A(λ)x = 0. For many years, linearizations are used for solving polynomial and rational eigenvalue problems. On the other hand, for the general nonlinear case, A(λ) can first be approximated by a (rational) matrix polynomial and then a convenient linearization is us...

متن کامل

Krylov Methods for Nonlinear Eigenvalue Problems

We present two generalisations of the Krylov subspace method, Arnoldi for the purpose of applying them to nite dimensional eigenvalue problems nonlinear in the eigenvalue parameter. The rst method is called nonlinear rational Krylov subspace and approximates and updates the projection of a linearised problem by nesting a one-sided secant method with Arnoldi. The second method, called nonlinear ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012